Notes on Phoradendron flavescens, Nutt. I

Notes on Sandflies. Part I

I. Notes on Structured Programming

These notes have the status of "Letters written to myself": I wrote them down because, without doing so, I found myself repeating the same arguments over and over again. When reading what I had written, I was not always too satisfied. For one thing, I felt that they suffered from a marked verbosity. Yet I do not try to condense them (now), firstly because that would introduce another delay and ...

Lecture Notes on Approximation Algorithms Volume I

These lecture notes are based on the course CS351 (Dept. of Computer Science, Stanford University) o ered during the academic year 1991-92. The notes below correspond to the rst half of the course. The second half consists of topics such as MAX SNP, cliques, and colorings, as well as more specialized material covering topics such as geometric problems, Steiner trees and multicommodity ows. The ...

Lecture Notes on Stochastic Calculus (Part I)

1 Probability “review” 3 1.1 σ-fields . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Random variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 Probability measures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.4 Distribution of a random variable . . . . . . . ....

Lecture Notes on Pseudorandomness { Part I

A fresh view at the question of randomness was taken in the theory of computing: It has been postulated that a distribution is pseudorandom if it cannot be told apart from the uniform distribution by any e cient procedure. This paradigm, originally associating e cient procedures with polynomial-time algorithms, has been applied also with respect to a variety of other classes of distinguishing p...